Set reconciliation with nearly optimal communication complexity
نویسندگان
چکیده
منابع مشابه
Set reconciliation with nearly optimal communication complexity
We consider the problem of efficiently reconciling two similar sets held by different hosts while minimizing the communication complexity, which we call the set reconciliation problem. We describe an approach to set reconciliation based on a polynomial encoding of sets. The resulting protocols exhibit tractable computational complexity and nearly optimal communication complexity when the sets b...
متن کاملNearly Optimal Separations Between Communication (or Query) Complexity and Partitions
We show a nearly quadratic separation between deterministic communication complexity and the logarithm of the partition number, which is essentially optimal. This improves upon a recent power 1.5 separation of Göös, Pitassi, and Watson (FOCS 2015). In query complexity, we establish a nearly quadratic separation between deterministic (and even randomized) query complexity and subcube partition c...
متن کاملSet Reconciliation in Two Rounds of Communication
In this work, we propose an approach, known as the C2SS-BF method, to synchronizing similar sets of data that uses an Invertible Bloom Filter (IBF). The C2SS-BF method builds on previous work by Eppstein et al. in [6]. By allowing two rounds of communication, we show that in many cases the proposed approach requires substantially less throughput than the algorithm proposed in [6]. The C2SS-BF c...
متن کاملNearly Optimal Bit Complexity Bounds for Computations with Structured Matrices
We present optimal, up to poly-logarithmic factors, bit complexity results for basic operations, matrix-vector multiplication and solving non-singular linear systems, with structured matrices.
متن کاملLearning Mixtures of Linear Regressions with Nearly Optimal Complexity
Mixtures of Linear Regressions (MLR) is an important mixture model with many applications. In this model, each observation is generated from one of the several unknown linear regression components, where the identity of the generated component is also unknown. Previous works either assume strong assumptions on the data distribution or have high complexity. This paper proposes a fixed parameter ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2003
ISSN: 0018-9448
DOI: 10.1109/tit.2003.815784